Practical Defeasible Reasoning for Description Logics
نویسندگان
چکیده
The preferential approach to nonmonotonic reasoning was consolidated in depth by Krause, Lehmann and Magidor (KLM) for propositional logic in the early 90’s. In recent years, there have been efforts to extend their framework to Description Logics (DLs) and a solid (though preliminary) theoretical foundation has already been established towards this aim. Despite this foundation, the generalisation of the propositional framework to DLs is not yet complete and there are multiple proposals for entailment in this context with no formal system for deciding between these. In addition, there are virtually no existing preferential reasoning implementations to speak of for DL-based ontologies. The goals of this PhD are to provide a complete generalisation of the preferential framework of KLM to the DL ALC, provide a formal understanding of the relationships between the multiple proposals for entailment in this context, and finally, to develop an accompanying defeasible reasoning system for DL-based ontologies with performance that is suitable for use in existing ontology development settings.
منابع مشابه
Towards Practical Defeasible Reasoning for Description Logics
The formalisation of defeasible reasoning in automated systems is becoming increasingly important. Description Logics (DLs) are nowadays the main logical formalism in the field of formal ontologies. Our focus in this paper is to devise a practical implementation for prior work that formalises a version of Rational Closure (an important type of defeasible reasoning) for DLs. We show that the con...
متن کاملPropositional Clausal Defeasible Logic
Defeasible logics are non-monotonic reasoning systems that have efficient implementations and practical applications. We list several desirable properties and note that each defeasible logic fails to have some of these properties. We define and explain a new defeasible logic, called clausal defeasible logic (CDL), which has all these properties. CDL is easy to implement, consistent, detects loo...
متن کاملMaking Quantification Relevant Again
Defeasible Description Logics (DDLs) extend Description Logics with defeasible concept inclusions. Reasoning in DDLs often employs rational or relevant closure according to the (propositional) KLM postulates. If in DDLs with quantification a defeasible subsumption relationship holds between concepts, this relationship might also hold if these concepts appear in existential restrictions. Such ne...
متن کاملMaking Quantification Relevant Again - the Case of Defeasible EL_\bot
Defeasible Description Logics (DDLs) extend Description Logics with defeasible concept inclusions. Reasoning in DDLs often employs rational or relevant closure according to the (propositional) KLM postulates. If in DDLs with quantification a defeasible subsumption relationship holds between concepts, this relationship might also hold if these concepts appear in existential restrictions. Such ne...
متن کاملLexicographic Closure for Defeasible Description Logics
In the field of non-monotonic logics, the lexicographic closure is acknowledged as a a powerful and logically well-characterized approach; we are going to see that such a construction can be applied in the field of Description Logics, an important knowledge representation formalism, and we shall provide a simple decision procedure.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014